A Novel Granularity Optimal Feature Selection based on Multi-Variant Clustering for High Dimensional Data

نویسندگان

چکیده

Clustering is the most complex in multi/high dimensional data because of sub feature selection from overall features present categorical sources. Sub set be aggressive approach to decrease dimensionality mining data, identification patterns. Main aim behind with respect optimal and redundancy. In-order compute redundant/irrelevant high sample exploration based on calculation granular described this document. Propose aNovel Granular Feature Multi-variant Genetic Algorithm (NGFMCGA) model evaluate performance results implementation. This main consists two phases, first phase, theoretic graph grouping procedure divide into different clusters, second select strongly representative related each cluster matching subset features. Features concept are independent proposed clustering have probability processing increasing quality useful features.Optimal improves accuracy classification, describes better applied publicly sets it compared traditional supervised evolutionary approaches

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Selection for Clustering on High Dimensional Data

This paper addresses the problem of feature selection for the high dimensional data clustering. This is a difficult problem because the ground truth class labels that can guide the selection are unavailable in clustering. Besides, the data may have a large number of features and the irrelevant ones can ruin the clustering. In this paper, we propose a novel feature weighting scheme for a kernel ...

متن کامل

Optimal Feature Selection for Data Classification and Clustering: Techniques and Guidelines

In this paper, principles and existing feature selection methods for classifying and clustering data be introduced. To that end, categorizing frameworks for finding selected subsets, namely, search-based and non-search based procedures as well as evaluation criteria and data mining tasks are discussed. In the following, a platform is developed as an intermediate step toward developing an intell...

متن کامل

High Dimensional Data Clustering Using Fast Cluster Based Feature Selection

Feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. A feature selection algorithm may be evaluated from both the efficiency and effectiveness points of view. While the efficiency concerns the time required to find a subset of features, the effectiveness is related to the quality of the subset of fea...

متن کامل

Optimal Feature Selection for Data Classification and Clustering: Techniques and Guidelines

In this paper, principles and existing feature selection methods for classifying and clustering data be introduced. To that end, categorizing frameworks for finding selected subsets, namely, search-based and non-search based procedures as well as evaluation criteria and data mining tasks are discussed. In the following, a platform is developed as an intermediate step toward developing an intell...

متن کامل

Feature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach

Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Turkish Journal of Computer and Mathematics Education

سال: 2021

ISSN: ['1309-4653']

DOI: https://doi.org/10.17762/turcomat.v12i3.2031